Verifying Linear Duration . . .

نویسنده

  • Dang Van Hung
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Linear Duration Properties of Probabilistic Real-time Systems

In this paper we present a method for deciding whether a probabilistic real-time system, modelled as a Markov chain, satisses a linear duration property at a given time interval with a given lower bound of the probability. With this method we can reduce the problem into a nite number of integer linear constraint systems, which have been well studied can be solved with a polynomial-time algorithm.

متن کامل

Checking Linear Duration Invariants by Linear Programming

In this paper, the problem of verifying a timed automaton for a Duration Calculus formula in the form of linear duration invariants 2] is addressed. We show that by linear programming, a particular class of timed automata including the class of real-time automata as a proper subset, can be checked for linear duration invariants. The so-called real-time regular expressions is introduced to expre...

متن کامل

Extending Regular Expressions with Duration Constraints for Modelling and Verifying Hybrid Systems

In this paper, we introduce the formalism of duration-constrained regular expressions to model real-time and hybrid systems, which is an extension of regular expressions with duration constraints. It is equivalent in expressive power to a class of linear hybrid automata called loop-closed automata in which any variable tested in a loop is reset or tested to exact values in the same loop. Based ...

متن کامل

On Checking Timed Automata for Linear Duration Invariants

In this work, we address the problem of verifying a Timed Automaton for a real-time property written in Duration Calculus in the form of Linear Duration Invariants. We present a conservative method for solving the problem using the linear programming techniques. First, we provide a procedure to translate Timed Automata to a sort of regular expressions for timed languages. Then, we extend the li...

متن کامل

A Verification of Linear Duration Properties over Continuous Time Markov Chains

Stochastic modelling and algorithmic verification techniques have been proved useful in analysing and detecting unusual trends in performance and energy usage of systems such as power management controllers and wireless sensor devices. Many important properties are dependent on the cumulated time that the device spends in certain states, possibly intermittently. We study the problem of verifyin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004